Kinodynamic Robot Motion Planning Based on the Generalised Voronoi Diagram
نویسنده
چکیده
Kinodynamic motion planning of an autonomous robot in an unknown or partially known indoor or outdoor environment is a challenging task, especially when the generated path must maintain the largest distance from surrounding obstacles and the robot’s kinodynamic properties, its localisation, and uncertainty of the environment are also considered. A new motion planning technique, which is built on the generalised Voronoi diagram, for a robot with kinematic or dynamic constraints is proposed. The generalised Voronoi diagram serves this task effectively as it maintains the largest (the safest) possible distance from surrounding obstacles. Moreover, a novel approximation geometric algorithm, which embodies a trade-off between the efficiency of computation, implementation difficulty, and robustness, for computing this diagram is presented.
منابع مشابه
Robot Motion Planning Using Generalised Voronoi Diagrams
In robot motion planning in a space with obstacles, the goal is to find a collision-free path of robot from the starting to the target position. There are many fundamentally different approaches, and their modifications, to the solution of this problem depending on types of obstacles, dimensionality of the space and restrictions for robot movements. Among the most frequently used are roadmap me...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملDealing with Geometric Complexity in Motion Planning
We consider the issues involved in writing path planners that can work well with complex geometric models of robots and workspaces, and outline our work in implementing a solution. We claim that many path planning problems can be solved by a mixture of global and local planning. In turn, local planning can be usefully supported by the provision of efficient distance computations. Global plannin...
متن کاملSampling-based Multi-robot Motion Planning
This paper describes a sampling-based approach to multi-robot motion planning. The proposed approach is centralized, which aims to reduce interference between mobile robots such as collision, congestion and deadlock, by increasing the number of waypoints. The implementation based on occupancy grid map is decomposed into three steps: the first step is to identify primary waypoints by using the V...
متن کاملRoadmap Methods vs. Cell Decomposition in Robot Motion Planning
The task of planning trajectories plays an important role in transportation, robotics, information systems (sending messages), etc. In robot motion planning, the robot should pass around obstacles from a given starting position to a given target position, touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. Research on path planning has...
متن کامل